Invasion Percolation on the Poisson-weighted Infinite Tree by Louigi Addario-berry1,
نویسندگان
چکیده
We study invasion percolation on Aldous’ Poisson-weighted infinite tree, and derive two distinct Markovian representations of the resulting process. One of these is the σ →∞ limit of a representation discovered by Angel et al. [Ann. Appl. Probab. 36 (2008) 420–466]. We also introduce an exploration process of a randomly weighted Poisson incipient infinite cluster. The dynamics of the new process are much more straightforward to describe than those of invasion percolation, but it turns out that the two processes have extremely similar behavior. Finally, we introduce two new “stationary” representations of the Poisson incipient infinite cluster as random graphs on Z which are, in particular, factors of a homogeneous Poisson point process on the upper half-plane R× [0,∞).
منابع مشابه
Poisson-dirichlet Branching Random Walks
We determine, to within O(1), the expected minimal position at level n in certain branching random walks. The walks under consideration have displacement vector (v1, v2, . . .) where each vj is the sum of j independent Exponential(1) random variables and the different vi need not be independent. In particular, our analysis applies to the Poisson-Dirichlet branching random walk and to the Poisso...
متن کاملThe Scaling Limit of Random Simple Triangulations and Random Simple Quadrangulations
The scaling limit of random simple triangulations and random simple quadrangulations . . . . . . . . . . . . . LOUIGI ADDARIO-BERRY AND MARIE ALBENQUE 2767 Recurrence and transience for the frog model on trees CHRISTOPHER HOFFMAN, TOBIAS JOHNSON AND MATTHEW JUNGE 2826 Stochastic De Giorgi iteration and regularity of stochastic partial differential equations ELTON P. HSU, YU WANG AND ZHENAN WANG...
متن کاملCritical random graphs and the structure of a minimum spanning tree
We consider the complete graph on n vertices whose edges are weighted by independent and identically distributed edge weights and build the associated minimum weight spanning tree. We show that if the random weights are all distinct, then the expected diameter of such a tree is Θ(n). This settles a question of Frieze and McDiarmid [15]. The proofs are based on a precise analysis of the behaviou...
متن کاملOn the Spread of Random Graphs
Combinatorics, Probability and Computing / Volume 23 / Issue 04 / July 2014, pp 477 504 DOI: 10.1017/S0963548314000248, Published online: 13 June 2014 Link to this article: http://journals.cambridge.org/abstract_S0963548314000248 How to cite this article: LOUIGI ADDARIO-BERRY, SVANTE JANSON and COLIN McDIARMID (2014). On the Spread of Random Graphs . Combinatorics, Probability and Computing, 23...
متن کامل